Satisficing Contracts
نویسنده
چکیده
We propose a model of equilibrium contracting between two agents who are “boundedly rational” in the sense that they face time costs of deliberating current and future transactions. We show that equilibrium contracts may be incomplete and assign control rights: they may leave some enforceable future transactions unspecified and instead specify which agent has the right to decide these transactions. Control rights allow the controlling agent to defer time-consuming deliberations on those transactions to a later date, making her less inclined to prolong negotiations over an initial incomplete contract. Still, agents tend to resolve conflicts up-front by writing more complete initial contracts. A more complete contract can take the form of either a finer adaptation to future contingencies, or greater coarseness. Either way, conflicts among contracting agents tend to result in excessively complete contracts in the sense that the maximization of joint payoffs would result in less complete contracts.
منابع مشابه
An Interactive Fuzzy Satisficing Method for Multiobjective Operation Planning of District Heating and Cooling Plants Considering Various Penalties for Violation of Contract
District heating and cooling (DHC) systems have been actively introduced as energy supply systems in urban areas. Since there exist a number of large-size freezers, heat exchangers and boilers in a DHC plant to generate and supply cold water, hot water and steam to a DHC system, the control under an operation plan for these instruments on the basis of the demand of cold water, hot water and ste...
متن کاملContract Types for Satisficing Task Allocation:I Theoretical Results
We analyze task reallocation where individually rational ([R) agents (re)contract tasks among themselves based on marginal costs. A task allocation graph is introduced as a tool for analyzing contract types. Traditional single task contracts always have a short path (sequence of contracts) to the optimal task allocation but an IR path may not exist, or it may not be short. We analyze an algorit...
متن کاملOptimal Satisficing
Herbert Simon introduced the notion of satisficing to explain how boundedly rational agents might approach difficult sequential decision problems. His satisficing decision makers were offered as an alternative to optimizers, who have impressive computational capacities which allow them to maximize. There is no reason, however, why satisficers can not do their task optimally. In this paper, we p...
متن کاملUsing Satisficing Game Theory for Performance Evaluation of Banks’ Branches (Case Study in the Mellat Bank)
Due to its role in the identification of inefficient branches and deciding the consistency of their activities, evaluating the performance of a bankchr('39')s branches is one of the most important decisions in the field of development and regulation of branch network. In this paper, the satisfactory functions based on game theory strategies have been utilized in order to evaluate the individual...
متن کاملSatisficing and bounded optimality A position paper
Since the early days of artificial intelligence there has been a constant search for useful techniques to tackle the computational complexity of decision making. By now, it is widely accepted that optimal decision making is in most cases beyond our reach. Herbert Simon’s approach based on satisficing offers a more realistic alternative, but it says little on how to construct satisficing algorit...
متن کامل